Recursive Quantum Functions, Avoidable Points, & Shadow Points in Recursive Analysis
نویسندگان
چکیده
منابع مشابه
Reference points based recursive approximation
The paper studies polynomial approximation models with a new type of constraints that enable to get estimates with significant properties. Recently we enhanced a representation of polynomials based on three reference points. Here we propose a two-part cubic smoothing scheme that leverages this representation. The presence of these points in the model has several consequences. The most important...
متن کاملCharacteristic Points of Recursive Systems
Characteristic points have been a primary tool in the study of a generating function defined by a single recursive equation. We investigate the proper way to adapt this tool when working with multi-equation recursive systems. Given an irreducible non-negative power series system with m equations, let ρ be the radius of convergence of the solution power series and let τ be the values of the solu...
متن کاملOn Some Recursive Residual Rank Tests for Change~points on Some Recursive Residual Rank Tests for Change-points
A general class of recursive residuals is incorporated in the formulation of suitable (aligned) rank tests for change-points pertaining to some simple linear models. The asymptotic theory of the proposed tests rests on some invariance principles for recursively aligned signed rand statistics, and these are developed. Along with the asymptotic properties of the proposed tests, allied efficiency ...
متن کاملTests for Change-points Based on Recursive U-stattstics Tests for Change-points Based on Recursive U-statistics
Tests for change-points for location or regression models are often based on cumulative sums of recursive residuals. In the context of general estimable parameters (functionals of the underlying distributions), such recursive residuals may be defined in terms of recursive U-statistics. Along with some invariance principles for recursive U-statistics, asymptotic properties of some proposed tests...
متن کاملAnalysis of Parallelism in Recursive Functions on Recursive Data Structures
In functional languages, iterative operations on data collections are naturally expressed using recursive functions on recursive data structures. In this paper, we present a method to extract data parallelism from recursive functions and generate data parallel programs. As the parallel model for object programs, we use polytypic parallel skeletons. This model can express data parallel operation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2002
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)80380-3